Reversibility and oscillations in zero-sum discounted stochastic games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reversibility and Oscillations in Zero-sum Discounted Stochastic Games

We show that by coupling two well-behaved exit-time problems one can construct two-person zero-sum stochastic games with finite state space having oscillating discounted values. This unifies and generalizes recent examples due to Vigeral (2013) and Ziliotto (2013).

متن کامل

Definable Zero-Sum Stochastic Games

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally subanalytic stochastic games. We prove that the Shapley operator of any definable stochastic game with separable transition and reward functions is definable in...

متن کامل

Sampling Techniques for Zero-sum, Discounted Markov Games

In this paper, we first present a key approximation result for zero-sum, discounted Markov games, providing bounds on the state-wise loss and the loss in the sup norm resulting from using approximate Q-functions. Then we extend the policy rollout technique for MDPs to Markov games. Using our key approximation result, we prove that, under certain conditions, the rollout technique gives rise to a...

متن کامل

Discounted Stochastic Games

We give an alternative proof to a result of Mertens and Parthasarathy, stating that every n-player discounted stochastic game with general setup, and with a norm-continuous transition, has a subgame perfect equilibrium. † Institute of Mathematics and Center for Rationality and Interactive Decision Theory, The Hebrew University, Givat Ram, 91904 Jerusalem, Israel. e-mail: [email protected] ...

متن کامل

Minimizing Regret in Discounted-Sum Games

In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal regret of the controller (Eve) as well as several variants depending on which strategies the environment (Adam) is permitted to use. We also consider the problem of synthesizing regret-free strategies for Eve in each...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamics and Games

سال: 2015

ISSN: 2164-6066

DOI: 10.3934/jdg.2015.2.103